Bonn Econ Discussion Papers U-type versus J-type Tournaments U-type versus J-type Tournaments*

نویسنده

  • Matthias Kräkel
چکیده

In practice, two types of tournaments can be distinguished − U-type and J-type tournaments. In U-type tournaments, workers receive prizes that have been fixed in advance. In J-type tournaments, the employer fixes an aggregate wage bill in advance, which is then shared among the workers according to their relative performance. The results of the paper show that the outcomes of the two tournament types substantially differ. Especially, an employer will prefer J-type to U-type tournaments if the number of workers is large, whereas the opposite holds for small numbers of workers. JEL classification: J3, M1.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Weighted Composition Operators From Logarithmic Bloch Type Spaces to $ n $'th Weighted Type Spaces

Let $ mathcal{H}(mathbb{D}) $ denote the space of analytic functions on the open unit disc $mathbb{D}$. For a weight $mu$ and a nonnegative integer $n$, the $n$'th weighted type space $ mathcal{W}_mu ^{(n)} $ is the space of all $fin mathcal{H}(mathbb{D}) $ such that $sup_{zin mathbb{D}}mu(z)left|f^{(n)}(z)right|begin{align*}left|f right|_{mathcal{W}_...

متن کامل

Enumeration and dichromatic number of tame tournaments

The concept of molds, introduced by the authors in a recent preprint, break regular tournaments naturally into big classes: cyclic tournaments, tame tournaments and wild tournaments. We enumerate completely the tame molds, and prove that the dichromatic number of a tame tournament is 3.

متن کامل

A Recurrence for Bounds on Dominating Sets in k-Majority Tournaments

A k-majority tournament is realized by 2k−1 linear orders on the set of vertices, where a vertex u dominates v if u precedes v in at least k of the orders. Various properties of such tournaments have been studied, among them the problem of finding the size of a smallest dominating set. It is known that 2-majority tournaments are dominated by 3 vertices and that k-majority tournaments are domina...

متن کامل

Essays on Incentive Contracts under Moral Hazard and Non-Verifiable Performance

This thesis consists of four self-contained essays that compare real-world incentive schemes used to mitigate moral hazard problems under non-verifiable performance. The first essay contrasts the impact of the precision of performance measurement on wage costs in Uand J-type tournaments. In U-type tournaments prizes are fixed. In J-type tournaments only an overall wage sum is specified. The pri...

متن کامل

Unavoidable tournaments

A basic result in Ramsey theory states that any tournament contains a “large” transitive subgraph. Since transitive tournaments contain only transitive subgraphs, it is natural to ask which subgraphs must appear in any large tournament that is “far” from being transitive. One result of this type was obtained by Fox and Sudakov who characterized the tournaments that appear in any tournament that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001